Optimization of Full - Rate Full - Diversity Linear Space - Time Codes using the Union Bound
نویسندگان
چکیده
– Although many space-time codes sacrifice their rate in order to achieve a high diversity order, such a sacrifice is not necessary. Recent work has reported two instances of a linear space-time code that achieves both a full rate of min(t, r) and a full diversity order of tr over a t-input r-output Rayleigh-fading channel [1][2]. We show that such full-rate full-diversity codes are plentiful and can, in fact, be found with probability one by randomly choosing an encoding matrix from an ensemble of matrices with orthonormal columns. However, full rate and full diversity does not guarantee good error-rate performance. Different encoding matrices with the same rate and diversity order can have markedly different error rates. We propose the union bound on word-error rate as an optimization metric and perform constrained optimization to find good space-time codes. For the two-input, two-output Rayleigh channel, we present an optimized code that outperforms the previously reported codes of [1][2] by 1.25 dB at 4 b ⁄ s ⁄ Hz and a frame-error rate of 10 –3 .
منابع مشابه
Characterization of $2times 2$ full diversity space-time codes and inequivalent full rank spaces
In wireless communication systems, space-time codes are applied to encode data when multiple antennas are used in the receiver and transmitter. The concept of diversity is very crucial in designing space-time codes. In this paper, using the equivalent definition of full diversity space-time codes, we first characterize all real and complex $2times 2$ rate one linear dispersion space-...
متن کاملFull-Diversity Space-Time Block Codes for Integer-Forcing Linear Receivers
In multiple-input multiple-output (MIMO) fading channels, the design criterion for full-diversity space-time block codes (STBCs) is primarily determined by the decoding method at the receiver. Although constructions of STBCs have predominantly matched the maximum-likelihood (ML) decoder, design criteria and constructions of full-diversity STBCs have also been reported for low-complexity linear ...
متن کاملA full NT-step O(n) infeasible interior-point method for Cartesian P_*(k) –HLCP over symmetric cones using exponential convexity
In this paper, by using the exponential convexity property of a barrier function, we propose an infeasible interior-point method for Cartesian P_*(k) horizontal linear complementarity problem over symmetric cones. The method uses Nesterov and Todd full steps, and we prove that the proposed algorithm is well define. The iteration bound coincides with the currently best iteration bound for the Ca...
متن کاملAlgebraic space-time codes with full diversity and low peak-to-mean power ratio
A new class of full diversity space-time codes is proposed that leads to a significantly smaller Peak-to-Mean Envelope Power Ratio (PMEPR) compared to the recently invented Diagonal Algebraic SpaceTime (DAST) and Threaded Algebraic Space-Time (TAST) codes. Moreover, the proposed “Low PMEPR Space-Time” (LPST) codes exhibit identical performance and decoding complexity compared to the TAST codes....
متن کاملFull rate full diversity linear quasi-orthogonal space-time codes for any transmit antennas
We construct a class of linear quasi-orthogonal space-time block codes that achieve full diversity over quasi-static fading channels for any transmit antennas. These codes achieve a normalized rate of 1 symbol per channel use. Constellation rotation is shown to be necessary for the full diversity feature of these codes. When the number of transmit antennas is a power of two, these codes are als...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003